package com.captain.special.二叉树;

import com.captain.leetcode.TreeNode;

/**
 * Des:
 *
 * @author XL
 * @Date 2022/5/2 22:01
 */
public class 路径总和112 {
    public boolean hasPathSum(TreeNode root, int targetSum) {
        return true;
    }

    public boolean recur(TreeNode node, int targetSum, int previousLayer) {
        return true;
    }
}
